| 翻訳と辞書 |
| Distance geometry ： ウィキペディア英語版 |
Distance geometry problem
The distance geometry problem is the characterization and study of sets of points based ''only'' on given values of the distances between member pairs.〔〔〔 Therefore distance geometry has immediate relevance where distance values are determined or considered, such as biology,〔 sensor network,〔 surveying, cartography and physics.
==Applications==
The distance geometry problem (DGP) is the one of finding the coordinates of a set of points by using the distances between some pairs of such points.〔 There exists nowadays a large community that is actively working on this problem, because there are several real-life applications that can lead to the formulation of a DGP. As an example, an interesting application is the one of locating sensors in telecommunication networks.〔 In such a case, the positions of some sensors are known (which are called anchors) and some of the distances between sensors (which can be anchors or not) are also known: the problem is to identify the positions in space for all sensors.
An interesting application arises in biology.〔〔 Experimental techniques are able to estimate distances between pairs of atoms of a given molecule, and the problem becomes the one of identifying the three-dimensional conformation of the molecule, i.e. the positions of all its atoms. In this field, the main interest is on proteins, because discovering their three-dimensional conformation allows us to get clues about the function they are able to perform. The implications in related fields, such as biomedicine and drug design, are evident. When dealing with biological molecules, the DGP is generally referred to as molecular DGP (MDGP).
In the following, even if the article considers in general the DGP, the MDGP will be used as an example.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Distance geometry problem」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|